Engineering Route Planning Algorithms
نویسندگان
چکیده
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-dependent routing, and flexible objective functions.
منابع مشابه
Robot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملDepartment of Computer Science and Software Engineering 2012 Departmental Postgraduate Conference
Keynotes Dr. James Smithies: Building the Canterbury Earthquakes Digital Archive Senior Lecturer in Digital Humanities, University of Canterbury Dr. Ray Hidayat: Interesting Algorithms in Telogis Route Telogis Route is full of complex algorithms. When planning driver territories, how can we estimate the required driving time quickly? When optimising routes, how can we discourage routes from ove...
متن کاملModeling Individual Driving Route Preferences from Relative Feedback
A common, yet diicult, task for people is planning satisfactory driving routes. Automatic systems for driving directions exist, but one of their major diiculties is the range of individual diierence regarding what constitutes a good route and a bad route. We introduce an adaptive user interface for route planning that uses relative feedback to model individual route preferences. Our experiments...
متن کاملEngineering Fast Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s algorithm. We outline ideas, algorithms, implementations, and experimental methods behind this development. We also explain why the story is not over yet because dynamically changing networks, flexible objective function...
متن کاملThe partial sequenced route query with traveling rules in road networks
In modern geographic information systems, route search represents an important class of queries. In route search related applications, users may want to define a number of traveling rules (traveling preferences) when they plan their trips. However, these traveling rules are not considered in most existing techniques. In this paper, we propose a novel spatial query type, the multi-rule partial s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009